Cup-length estimates for leaf-wise intersections
نویسندگان
چکیده
منابع مشابه
Leaf-wise Intersections and Rabinowitz Floer Homology
In this article we explain how critical points of a perturbed Rabinowitz action functional give rise to leaf-wise intersection points in hypersurfaces of restricted contact type. This is used to derive existence results for hypersurfaces in general exact symplectic manifolds.
متن کاملNon-displaceable Contact Embeddings and Infinitely Many Leaf-wise Intersections
We construct using Lefschetz fibrations a large family of contact manifolds with the following properties: Any bounding contact embedding into an exact symplectic manifold satisfying a mild topological assumption is non-displaceable and generically has infinitely many leaf-wise intersection points. Moreover, any Stein filling has infinite dimensional symplectic homology.
متن کاملOn k-wise set-intersections and k-wise Hamming-distances
We prove a version of the Ray-Chaudhuri–Wilson and Frankl–Wilson theorems for k-wise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a; a; . . . ; ak of length n have k-wise Hamming-distance ‘; if there are exactly ‘ such coordinates, where not all of their coordinates coincide (alternatively, exactly n ‘ of their...
متن کاملK-wise Set-intersections and K-wise Hamming-distances
We prove a version of the Ray-Chaudhuri{Wilson and Frankl-Wilson theorems for kwise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a1; a2; : : : ; ak of length n have k-wise Hamming-distance `, if there are exactly ` such coordinates, where not all of their coordinates coincide (alternatively, exactly n ` of thei...
متن کاملComparison of width-wise and length-wise language model compression
In this paper we investigate the extent to which Katz backoff language models can be compressed through a combination of parameter quantization (width-wise compression) and parameter pruning (length-wise compression) methods while preserving performance. We compare the compression and performance that is achieved using entropy-based pruning against that achieved using only parameter quantizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society
سال: 2010
ISSN: 0305-0041,1469-8064
DOI: 10.1017/s0305004110000435